Matching theory

Results: 1366



#Item
21PHYSICAL REVIEW E 90, Efficiently inferring community structure in bipartite networks Daniel B. Larremore,1,2 Aaron Clauset,3,4,5 and Abigail Z. Jacobs3 1

PHYSICAL REVIEW E 90, Efficiently inferring community structure in bipartite networks Daniel B. Larremore,1,2 Aaron Clauset,3,4,5 and Abigail Z. Jacobs3 1

Add to Reading List

Source URL: danlarremore.com

Language: English - Date: 2014-07-10 17:42:30
22On the Strong Chromatic Index of Sparse Graphs Philip DeOrsey1,6 Jennifer Diemunsch2,6 Michael Ferrara2,6,7 2,6 3,6,8

On the Strong Chromatic Index of Sparse Graphs Philip DeOrsey1,6 Jennifer Diemunsch2,6 Michael Ferrara2,6,7 2,6 3,6,8

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2015-07-03 21:55:58
23Efficient Comparison of Massive Graphs Through The Use Of ‘Graph Fingerprints’ Stephen Bonner John Brennan

Efficient Comparison of Massive Graphs Through The Use Of ‘Graph Fingerprints’ Stephen Bonner John Brennan

Add to Reading List

Source URL: www.mlgworkshop.org

Language: English - Date: 2016-08-14 01:22:56
24Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2014-11-26 08:32:33
25CSE 584A Class 14 Jeremy Buhler March 9, 2016 The BWT is sufficient for simple pattern matching, but can it do more?

CSE 584A Class 14 Jeremy Buhler March 9, 2016 The BWT is sufficient for simple pattern matching, but can it do more?

Add to Reading List

Source URL: classes.engineering.wustl.edu

Language: English - Date: 2016-03-15 16:00:32
26Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:48:33
27Modeling and Learning Synergy for Team Formation with Heterogeneous Agents Somchaya Liemhetcharat Manuela Veloso

Modeling and Learning Synergy for Team Formation with Heterogeneous Agents Somchaya Liemhetcharat Manuela Veloso

Add to Reading List

Source URL: somchaya.org

Language: English - Date: 2014-05-05 11:44:11
28Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset

Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset

Add to Reading List

Source URL: tuvalu.santafe.edu

Language: English - Date: 2013-11-23 11:09:17
29Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:26:37
30BR-Index: An Indexing Structure for Subgraph Matching in Large Dynamic Graphs Jiong Yang and Wei Jin EECS Department Case Western Reserve University

BR-Index: An Indexing Structure for Subgraph Matching in Large Dynamic Graphs Jiong Yang and Wei Jin EECS Department Case Western Reserve University

Add to Reading List

Source URL: ssdbm2011.ssdbm.org

Language: English - Date: 2011-09-01 19:29:56